An Explication of Multifarious Secret Sharing Schemes
نویسندگان
چکیده
The idea of secret sharing is to start with a secret, divide it into pieces called shares, which are then distributed amongst participants by the dealer. Only certain authorized subsets of participants can reconstruct the original secret. Applications for secret sharing schemes seem to be getting more important nowadays. For many circumstances, secret sharing has to provide more flexibility and functionality as per the need of an application. Secret Sharing has been an active research field for many years. Various secret sharing techniques have been developed to secure data, but there is a need to implement a secret sharing scheme with all augmented capabilities like general access structure, robustness against cheating shareholders, verifiability of the shares, proactive redistribution of shares etc. The intent of this paper is to explain the extended capabilities of secret sharing schemes and analyze the relation in application semantics and multifarious secret sharing schemes.
منابع مشابه
Security Analysis of a Hash-Based Secret Sharing Scheme
Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...
متن کاملComputationally secure multiple secret sharing: models, schemes, and formal security analysis
A multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants. in such a way a multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants, such that any authorized subset of participants can reconstruct the secrets. Up to now, existing MSSs either require too long shares for participants to be perfect secur...
متن کاملAn Explication of Secret Sharing Schemes
This paper is an explication of secret sharing schemes, emphasizing combinatorial construction methods. The main problem we consider is the construction of perfect secret sharing schemes, for specified access structures, with the maximum possible information rate. In this paper, we present numerous direct constructions for secret sharing schemes, such as the Shamir threshold scheme, the Boolean...
متن کاملA Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions
A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...
متن کاملAn Explication of Secret Sharing Schemes with General Access Structure
The basic idea in secret sharing is to divide the secret key into pieces, also called as ‘shares’ and distribute the pieces to different persons so that certain subsets of the persons can get together to recover the key. In the outline of threshold schemes, we wanted k out of n participants to be able to determine the key. In practice, it is often needed that only certain specified subsets of t...
متن کامل